Recursive method for computing matrix elements for two-body interactions
نویسندگان
چکیده
منابع مشابه
Alternating Recursive Method for Q-matrix Learning
The key issue affecting Cognitive Diagnostic Models (CDMs) is how to specify attributes and the Q-matrix. In this paper, we first attempt to use the Boolean Matrix Factorization (BMF) method to express conjunctive models in CDMs. Because BMF is an NPhard problem [2], we propose a recursive method that updates the attribute matrix (its rank equals to one) in each step. As Boolean algebra is irre...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملA New Method for Computing Determinants By Reducing The Orders By Two
In this paper we will present a new method to calculate determinants of square matrices. The method is based on the Chio-Dodgson's condensation formula and our approach automatically affects in reducing the order of determinants by two. Also, using the Chio's condensation method we present an inductive proof of Dodgson's determinantal identity.
متن کاملAn Enhanced Finite Element method for Two Dimensional Linear Viscoelasticity using Complex Fourier Elements
In this paper, the finite element analysis of two-dimensional linear viscoelastic problems is performed using quadrilateral complex Fourier elements and, the results are compared with those obtained by quadrilateral classic Lagrange elements. Complex Fourier shape functions contain a shape parameter which is a constant unknown parameter adopted to enhance approximation’s accuracy. Since the iso...
متن کاملA recursive method for computing zeta functions of varieties
We present a method for calculating the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. Specifically, we outline an algorithm which reduces the problem of calculating a numerical approximation for the action of Frobenius on the middle-dimensional rigid cohomology of a smooth variety, to that of performing the same calculation for a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review C
سال: 2015
ISSN: 0556-2813,1089-490X
DOI: 10.1103/physrevc.91.054308